Attractors and repellers of Koch curves

نویسندگان

  • Przemyslaw Prusinkiewicz
  • Glen Sandness
چکیده

This paper presents two methods for generating Koch curves, analogous to the commonly used iterative methods for producing images of Julia sets. The attractive method is based on a characterization of Koch curves as the smallest nonempty sets closed with respect to a union of similarities on the plane. This characterization was first studied by Hutchinson. The repelling method is in principle dual to the attractive one, but involves a nontrivial problem of selecting the appropriate transformation to be applied at each iteration step. Both methods are illustrated with a number of computer−generated images. The mathematical presentation emphasizes the relationship between Koch construction and formal languages theory.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Real Projective Iterated Function Systems

This paper contains four main results associated with an attractor of a projective iterated function system (IFS). The first theorem characterizes when a projective IFS has an attractor which avoids a hyperplane. The second theorem establishes that a projective IFS has at most one attractor. In the third theorem the classical duality between points and hyperplanes in projective space leads to c...

متن کامل

Real Projective Iterated Function Systems

This paper contains four main results associated with an attractor of a projective iterated function system (IFS). The first theorem characterizes when a projective IFS has an attractor which avoids a hyperplane. The second theorem establishes that a projective IFS has at most one attractor. In the third theorem the classical duality between points and hyperplanes in projective space leads to c...

متن کامل

On the existence of attractors

On every compact 3-manifold, we build a non-empty open set U of Diff(M) such that, for every r ≥ 1, every Cr-generic diffeomorphism f ∈ U ∩Diffr(M) has no topological attractors. On higher dimensional manifolds, one may require that f has neither topological attractors nor topological repellers. Our examples have finitely many quasi attractors. For flows, we may require that these quasi attract...

متن کامل

Homoclinic Classes and Nitude of Attractors for Vector Elds on N-manifolds

A homoclinic class of a vector eld is the closure of the transverse homoclinic orbits associated to a hyperbolic periodic orbit. An attractor (a repeller) is a transitive set to which converges every positive (negative) nearby orbit. We show that a generic C 1 vector eld on a closed n-manifold has either innnitely many homoclinic classes or a nite collection of attrac-tors (repellers) whose bas...

متن کامل

Dynamical Neural Networks Construction

We show how Labeling RAAM (LRAAM) can be exploited to generatèon the y' neural networks for associative access of labeled structures. The topology of these networks, that we call Generalized Hoppeld Networks (GHN), depends on the topology of the query used to retrieve information, and the weights on the networks' connections are the weights of the LRAAM encoding the structures. A method for inc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007